On Quickselect, partial sorting and Multiple Quickselect
نویسنده
چکیده
We present explicit solutions of a class of recurrences related to the Quickselect algorithm. Thus we are immediately able to solve recurrences arising at the partial sorting problem, which are contained in this class. We show how the partial sorting problem is connected to the Multiple Quickselect algorithm and present a method for the calculation of solutions for a class of recurrences related to the Multiple Quickselect algorithm. Further an analysis of the partial sorting problem for the ranks r, . . . , r+p−1 given the array A[1, . . . , n] is provided.
منابع مشابه
Chunksort: A Generalized Partial Sorting Algorithm
We introduce here the problem of generalized partial sorting and chunksort, an algorithm closely related to quicksort and quickselect that solves this problem in an elegant and efficient way. In generalized partial sorting we are given an array of n elements and p intervals I1 = [`1,u1], I2 = [`2,u2], . . . , Ip = [`p,up], which define p blocks in the array and p+1 gaps between the blocks. The ...
متن کاملMoves and displacements of particular elements in Quicksort
In this research note we investigate the number of moves and the displacement of particular elements during the execution of the well-known quicksort algorithm. This type of analysis is useful if the costs of data moves were dependent on the source and target locations, and possibly the moved element itself. From the mathematical point of view, the analysis of these quantities turns out to be r...
متن کاملAn Extended Note on the Comparison-optimal Dual-Pivot Quickselect
In this note the precise minimum number of key comparisons any dual-pivot quickselect algorithm (without sampling) needs on average is determined. The result is in the form of exact as well as asymptotic formulæ of this number of a comparison-optimal algorithm. It turns out that the main terms of these asymptotic expansions coincide with the main terms of the corresponding analysis of the class...
متن کاملOn a Reciprocity Law for Finite Multiple Zeta Values
Abstract. It was shown in [7, 9] that harmonic numbers satisfy certain reciprocity relations, which are in particular useful for the analysis of the quickselect algorithm. The aim of this work is to show that a reciprocity relation from [7, 9] can be generalized to finite variants of multiple zeta values, involving a finite variant of the shuffle identity for multiple zeta values. We present th...
متن کاملPartitioning schemes for quicksort and quickselect
We introduce several modifications of the partitioning schemes used in Hoare’s quicksort and quickselect algorithms, including ternary schemes which identify keys less or greater than the pivot. We give estimates for the numbers of swaps made by each scheme. Our computational experiments indicate that ternary schemes allow quickselect to identify all keys equal to the selected key at little add...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 99 شماره
صفحات -
تاریخ انتشار 2006